Proof Learning in PVS With Utility Pattern Mining
نویسندگان
چکیده
منابع مشابه
High-Utility Sequential Pattern Mining with Multiple Minimum Utility Thresholds
High-utility sequential pattern mining is an emerging topic in recent decades and most algorithms were designed to identify the complete set of high-utility sequential patterns under the single minimum utility threshold. In this paper, we first propose a novel framework called high-utility sequential pattern mining with multiple minimum utility thresholds to mine high utility sequential pattern...
متن کاملBatch Proving and Proof Scripting in PVS
The batch execution modes of PVS are powerful, but highly technical, features of the system that are mostly accessible to expert users. This paper presents a PVS tool, called ProofLite, that extends the theorem prover interface with a batch proving utility and a proof scripting notation. ProofLite enables a semi-literate proving style where specification and proof scripts reside in the same fil...
متن کاملDeveloping Proof Rules for Distributed Real-Time Systems with PVS
In previous work, the veriication system PVS has been used to support an assertional method for the speciication and veriication of distributed real-time systems. Essential part of the method is a com-positional rule for parallel composition. In this paper we focus on the formalization of parallel composition in PVS. Two, equivalent, versions of the semantics of parallel composition are formula...
متن کاملUtility Based Frequent Pattern Mining in an Incremental Database
Weighted Frequent Pattern Mining (WFPM) has brought the notion of the weight of the items into the Frequent Pattern mining algorithms. WFPM is practically much efficient than the frequent pattern mining. Several Weighted Frequent Pattern Mining methods have been used. However, they do not deal with the interactive and incremental database. A IWFPTWU algorithm has been proposed to allow the user...
متن کاملVerification of Hybrid Systems: Formalization and Proof Rules in PVS
Combining discrete state-machines with continuous behavior, hybrid systems are a well-established mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of research concentrates on model checking of finite abstractions of restricted subclasses of the gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3004199